Boolean satisfiability problem - PDFSEARCH.IO - Document Search Engine

Boolean satisfiability problem
Results: 324

#	Item
171	EagleUP: Solving Random 3-SAT using SLS with Unit Propagation Oliver Gableske1 and Marijn Heule2 1 2 Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2011-09-26 11:40:37 Logic programming Conjunctive normal form Local search Boolean satisfiability problem DPLL algorithm Theoretical computer science Constraint programming Declarative programming
172	Cube and Conquer: Guiding CDCL SAT Solvers by Lookaheads (PRELIMINARY VERSION; [removed]) ⋆ Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2011-09-25 04:19:32 Logic in computer science NP-complete problems Electronic design automation Formal methods Automated theorem proving Boolean satisfiability problem Satz Lookahead Solver Theoretical computer science Mathematics Applied mathematics
173	Exact DFA Identification Using SAT Solvers Marijn J.H. Heule1, and Sicco Verwer2 1 2 Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2010-11-29 07:36:36 Automata theory NP-complete problems Graph coloring Graph theory Boolean satisfiability problem Deterministic finite automaton Clique DFA Records Powerset construction Theoretical computer science Mathematics Applied mathematics
174	Trimming while Checking Clausal Proofs Marijn J.H. Heule, Warren A. Hunt, Jr., and Nathan Wetzler The University of Texas at Austin Abstract—Conflict-driven clause learning (CDCL) satisfiability solvers can emit more t Add to Reading List Source URL: www.cs.utexas.edu Language: English - Date: 2014-01-02 11:58:01 Unsatisfiable core Conjunctive normal form Resolution Five lemma Theorem Logic programming Unit propagation Automated proof checking Boolean satisfiability problem Logic Mathematics Automated theorem proving
175	Clause Elimination Procedures for CNF Formulas Marijn Heule1 , Matti J¨arvisalo2 , and Armin Biere3 1 3 Department of Software Technology, Delft University of Technology, The Netherlands Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2010-11-29 07:34:30 Automated theorem proving Mathematical logic Propositional calculus Logic in computer science NP-complete problems Conjunctive normal form Resolution Boolean satisfiability problem Unit propagation Theoretical computer science Logic Mathematics
176	Revisiting Hyper Binary Resolution Marijn J.H. Heule1,3 , Matti J¨arvisalo2 , and Armin Biere3 1 3 Department of Computer Science, The University of Texas at Austin, United States Add to Reading List Source URL: www.cs.utexas.edu Language: English - Date: 2014-01-02 14:06:39 Automated theorem proving Logic in computer science NP-complete problems Conjunctive normal form Resolution Unit propagation Boolean satisfiability problem Literal Transitivity Theoretical computer science Mathematical logic Mathematics
177	Covered Clause Elimination Marijn Heule∗ TU Delft, The Netherlands Matti J¨arvisalo† Univ. Helsinki, Finland Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2010-11-29 07:30:47 Automated theorem proving Logic in computer science NP-complete problems Logic programming Conjunctive normal form Boolean satisfiability problem Unit propagation Resolution Clause Theoretical computer science Mathematical logic Mathematics
178	Blocked Clause Elimination and its Extensions Marijn J. H. Heule∗ joint work with Matti J¨arvisalo and Armin Biere Abstract Boolean satisfiability (SAT) has become a core technology in many application Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2010-11-29 08:16:51 NP-complete problems Conjunctive normal form Automated theorem proving Boolean satisfiability problem Resolution Logic programming 2-satisfiability Theoretical computer science Mathematics Applied mathematics
179	Using a satisfiability solver to identify deterministic finite state automata Marijn J.H. Heule Sicco Verwer Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2009-08-19 05:30:10 NP-complete problems Complexity classes Logic in computer science Boolean algebra Boolean satisfiability problem Electronic design automation Graph coloring SL NP-complete Theoretical computer science Mathematics Computational complexity theory
180	Towards Ultra Rapid Restarts! Shai Haim1 and Marijn Heule 2 1 University of New South Wales and NICTA, Sydney, Australia 2 Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2011-02-20 08:31:36 Operations research Constraint programming Boolean algebra Logic in computer science Mathematical optimization Boolean satisfiability problem GRASP Solver Sol Theoretical computer science Applied mathematics Mathematics

UPDATE